Newsvendor Bounds and Heuristics for Serial Supply Chains with Regular and Expedited Shipping

نویسندگان

  • Sean X. Zhou
  • Xiuli Chao
چکیده

We study an infinite-horizon, N -stage, serial production/inventory system with two transportation modes between stages: regular shipping and expedited shipping. The optimal inventory policy for this system is a top–down echelon base-stock policy, which can be computed through minimizing 2N nested convex functions recursively (Lawson and Porteus, Oper Res 48 (2000), 878–893). In this article, we first present some structural properties and comparative statics for the parameters of the optimal inventory policies, we then derive simple, newsvendor-type lower and upper bounds for the optimal control parameters. These results are used to develop near optimal heuristic solutions for the echelon base-stock policies. Numerical studies show that the heuristic performs well. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 57: 71–87, 2010

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Newsvendor Bounds and Heuristics for Optimal Policy of Serial Supply Chains with and without Expedited Shippings∗

We consider N-stage serial production/distribution systems with stationary demand at the most downstream stage. First, we study classical Clark-Scarf model with both average cost and discounted cost criteria. The optimal echelon base-stock levels are obtained in terms of only probabilistic distributions of leadtime demand. This analysis yields a novel approach for developing bounds and simple h...

متن کامل

Analysis of Serial Supply Chains with a Service Constraint

We consider an N -stage serial supply chain with random demand, and study the problem of minimizing average inventory-holding cost subject to a pre-specified fill-rate constraint. Since the form of the optimal policy is unknown, we focus on base-stock policies. We present a bottom-up recursive procedure for policy evaluation and develop bounds on the optimal basestock levels. Using these bounds...

متن کامل

Newsvendor Bounds and A Heuristic for Optimal Policies in Serial Supply Chains

We consider the classic N -stage serial supply systems with linear costs and stationary random demands. There are deterministic transportation leadtimes between stages, and unsatisfied demands are backlogged. The optimal inventory policy for this system is known to be an echelon base-stock policy, which can be computed through minimizing N nested convex functions recursively. To identify the ke...

متن کامل

Supply chain risk mitigations with expedited shipping ¬リニ

We study supply chain risk mitigations by incorporating expedited shipping. The firm we consider can source from two suppliers—one is unreliable while the other is perfectly reliable but more expensive. It intends to mitigate the potential risks caused by random disruptions at the unreliable supplier by adapting its risk mitigation policy based on the supplier’s disruption factors, such as the ...

متن کامل

Impact of government’s policies on competition of two closed-loop and regular supply chains

With progressing technologies and new features of production, new products compete with older ones in markets. Indeed, new products initiate contest with olden ones and this process repeats in different productions lifetime several times. In this situation recycling the olden products seems to be significant for supply chains. Governments often levy special tariffs for these products as a contr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009